Comparing LOTOS and Z re nement relations

نویسندگان

  • John Derrick
  • Howard Bowman
  • Eerke Boiten
  • Maarten Steen
چکیده

This paper compares the LOTOS and Z re nement relations The motivation for such a comparison is the use of multiple viewpoints for specifying complex systems de ned by the reference model of the Open Distributed Processing ODP standard ization initiative The ODP architectural semantics describes the application of formal description techniques FDTs to the speci cation of ODP systems Of the available FDTs Z is likely to be used for at least the information and possibly other viewpoints whilst LOTOS is a strong candidate for use in the computational viewpoint Mechanisms are clearly needed to support the parallel development and integration of view points using these FDTs We compare the LOTOS bisimulation relations and the reduction relations to the Z re nement relation showing that failure traces re nement corresponds closely to re nement in Z

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing LOTOS and Z Refinement Relations

This paper compares the LOTOS and Z reenement relations. The motivation for such a comparison is the use of multiple viewpoints for specifying complex systems deened by the reference model of the Open Distributed Processing (ODP) standardization initiative. The ODP architectural semantics describes the application of formal description techniques (FDTs) to the speciication of ODP systems. Of th...

متن کامل

Speci cation of a Program Derivation Editor

In this paper a tool for structuring and manipulating formal program derivations is speci ed using the Z notation A program derivation style based on transitive re lations between programs as found in the re nement calculus is assumed The structuring and manipulation of derivations is based on the notion of re nement diagrams proposed by Back This allows for a style of derivation that is much m...

متن کامل

Consistency and re nement for partial speci cation in

This paper discusses theoretical background for the use of Z as a language for partial speci cation in particular techniques for check ing consistency between viewpoint speci cations The main technique used is uni cation i e nding a candidate least common re nement The corresponding notion of consistency between speci cations turns out to be di erent from the known notions of consistency for si...

متن کامل

Formal Design of a Modulo-N Counter

We illustrate the use of functional system speci cations and their re nement in the formal development of hardware systems by a small electronic device an asynchronous modulo N counter The development includes modular speci cation re nement and veri cation We start with an intuitive abstract requirements spec i cation and re ne this into a non trivial concrete bit level implementation The re ne...

متن کامل

Timewise Re nement for Communicating Processes

A theory of timewise re nement is presented This allows the translation of speci cations and proofs of correctness between semantic models permitting each stage in the veri cation of a system to take place at the appropriate level of abstraction The theory is presented within the context of CSP A denotational characterisation of re nement is given in terms of relations between behaviours at di ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009